Determination of fluoxetine in plasma by gas chromatography-mass spectrometry using stir bar sorptive extraction

This article presents a method employing stir bar sorptive extraction (SBSE) with in situ derivatization, in combination with either thermal or liquid desorption on-line coupled to gas chromatography-mass spectrometry for the analysis of fluoxetine in plasma samples. Ethyl chloroformate was employed as derivatizing agent producing symmetrical peaks. Parameters such as solvent polarity, time for analyte desorption, and extraction time, were evaluated. During the validation process, the developed method presented specificity, linearity (R-2 > 0.99), precision (R.S.D. < 15%), and limits of quantification (LOQ) of 30 and 1.37 pg mL(-1), when liquid and thermal desorption were employed, respectively. This simple and highly sensitive method showed to be adequate for the measurement-of fluoxetine in typical and trace concentration levels. (c) 2008 Elsevier B.V. All rights reserved.

Sequence-specific reconstruction from fragmentary databases using seed sequences: implementation and validation on SAGE, proteome and generic sequencing data

Motivation: DNA assembly programs classically perform an all-against-all comparison of reads to identify overlaps, followed by a multiple sequence alignment and generation of a consensus sequence. If the aim is to assemble a particular segment, instead of a whole genome or transcriptome, a target-specific assembly is a more sensible approach. GenSeed is a Perl program that implements a seed-driven recursive assembly consisting of cycles comprising a similarity search, read selection and assembly. The iterative process results in a progressive extension of the original seed sequence. GenSeed was tested and validated on many applications, including the reconstruction of nuclear genes or segments, full-length transcripts, and extrachromosomal genomes. The robustness of the method was confirmed through the use of a variety of DNA and protein seeds, including short sequences derived from SAGE and proteome projects.

Formal validation of automated policy refinement in the management of network security systems

Policy hierarchies and automated policy refinement are powerful approaches to simplify administration of security services in complex network environments. A crucial issue for the practical use of these approaches is to ensure the validity of the policy hierarchy, i.e. since the policy sets for the lower levels are automatically derived from the abstract policies (defined by the modeller), we must be sure that the derived policies uphold the high-level ones. This paper builds upon previous work on Model-based Management, particularly on the Diagram of Abstract Subsystems approach, and goes further to propose a formal validation approach for the policy hierarchies yielded by the automated policy refinement process. We establish general validation conditions for a multi-layered policy model, i.e. necessary and sufficient conditions that a policy hierarchy must satisfy so that the lower-level policy sets are valid refinements of the higher-level policies according to the criteria of consistency and completeness. Relying upon the validation conditions and upon axioms about the model representativeness, two theorems are proved to ensure compliance between the resulting system behaviour and the abstract policies that are modelled.